A Note on the Weight of Multicast Shortest Path Trees
نویسنده
چکیده
The weight of a multicast shortest path tree in the complete graph with exponential link weights is expressed as a random variable. The new framework elegantly allows the computation of the average multicast weight.
منابع مشابه
The Trade - o s of Multicast Trees and Algorithms 1
Multicast trees can be shared across sources (shared trees) or may be source-speciic (shortest path trees). Inspired by recent interests in using shared trees for interdomain multicasting, we investigate the trade-oos among shared tree types and source speciic shortest path trees, by comparing performance over both individual multicast group and the whole network. The performance is evaluated i...
متن کاملA Multicast Routing Protocol for Ad-Hoc Networks
The Core-Assisted Mesh Protocol (CAMP) is introduced for multicast routing in ad-hoc networks. CAMP generalizes the notion of core-based trees introduced for internet multicasting into multicast meshes that have much richer connectivity than trees. A shared multicast mesh is defined for each multicast group; the main goal of using such meshes is to maintain the connectivity of multicast groups ...
متن کاملThe core-assisted mesh protocol
The Core-Assisted Mesh Protocol (CAMP) is introduced for multicast routing in ad-hoc networks. CAMP generalizes the notion of core-based trees introduced for internet multicasting into multicast meshes that have much richer connectivity than trees. A shared multicast mesh is defined for each multicast group; the main goal of using such meshes is to maintain the connectivity of multicast groups ...
متن کاملMulticasting Along Meshes in Ad-Hoc Networks
The Core-Assisted Mesh Protocol (CAMP) is introduced for multicast routing in ad-hoc networks. CAMP generalizes the notion of core-based trees introduced for internet multicasting into multicast meshes that have much richer connectivity than trees. A shared multicast mesh is defined for each multicast group; the main goal of using such meshes is to maintain the connectivity of multicast groups ...
متن کاملThe Trade - o s of Multicast Trees and Algorithms Liming
Multicast trees can be shared across sources (shared trees) or may be source-speciic (shortest path trees). Inspired by recent interests in using shared trees for interdomain mul-ticasting, we investigate the trade-oos among shared tree types and source speciic shortest path trees, by comparing performance over both individual multicast group and the whole network. The performance is evaluated ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007